Approximation Resistant Predicates from Pairwise Independence
نویسندگان
چکیده
منابع مشابه
The Complexity of Somewhat Approximation Resistant Predicates
A boolean predicate f : {0, 1} → {0, 1} is said to be somewhat approximation resistant if for some constant τ > |f −1(1)| 2k , given a τ -satisfiable instance of the MAX k-CSP(f) problem, it is NP-hard to find an assignment that strictly beats the naive algorithm that outputs a uniformly random assignment. Let τ(f) denote the supremum over all τ for which this holds. It is known that a predicat...
متن کاملSDP Gaps from Pairwise Independence
This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P contains the support of a balanced pairwise independent distribution over the domain of the inputs, then such a problem on n variables cannot be approximated better than the trivial (random) approximation, even after augmenting th...
متن کاملPairwise Independence and Derandomization Pairwise Independence and Derandomization
This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a...
متن کاملOptimal Sherali-Adams Gaps from Pairwise Independence
This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P )). We show that if the set of assignments accepted by P contains the support of a balanced pairwise independent distribution over the domain of the inputs, then such a problem on n variables cannot be approximated better than the trivial (random) approximation, even using Ω(n) levels ...
متن کاملPairwise Independence and Derandomization
This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when the random strings used by the algorithm do not come from the uniform distribution, but rather from a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2009
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-009-0272-6